Model pigs face messy path

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Messy Solutions For Messy Problems

We spend|and waste|too much time discussing the pros and cons of diierent programming paradigms and too little time discussing the problems we want to solve. The rst section of this note introduces a problem; the remaining sections discuss approaches to solving it. 1 A problem The problem is to design a computer program that plays good snooker. (You can substitute \pool" or \billiards" for snoo...

متن کامل

Messy bureaucracies

In Government of paper, Matthew Hull has given us one of the most finely grained, ethnographically rich analyses of the role of material artifacts in the working of states. His focus on files, maps, the parchi and the petition, and lists and land records, is a sorely needed addition to the ethnographic record. As a linguistic anthropologist, he is uniquely positioned to reflect on the linguisti...

متن کامل

Heredity in Messy Chemistries

For natural selection to progress, there must be a sufficiently large evolutionary space to explore. In systems with template-based replication, this space is combinatorially large in the length of the information-carrying molecules. Previous work has shown that it is also possible for heredity to occur in much less structured chemistries; this opens the question of how the structure of a react...

متن کامل

Optimal 2D Model Matching Using a Messy Genetic Algorithm

A Messy Genetic Algorithm is customized toflnd’optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which chromosome length can vary. Consequently, population dynamics can be made to drive a relatively efficient and robust search for larger and better matches. Run-times for the Messy GA are as much as an order of magnitude sma...

متن کامل

Average-Case "messy" Broadcasting

Current studies of “messy” broadcasting have so far concentrated on finding worst-case times. However, such worst-case scenarios are extremely unlikely to occur in general. Hence, determining average-case times or tight upper bounds for completing “messy” broadcasting in various network topologies is both necessary and meaningful in practice. In this paper, we focus on seeking the average-case ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2012

ISSN: 0028-0836,1476-4687

DOI: 10.1038/486453a